Pascal and Francis Bibliographic Databases

Help

Search results

Your search

ti.\*:("Algorithms and Computation")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 2006

  • Page / 81
Export

Selection :

  • and

Algorithms and ComputationASANO, Takao; NAKANO, Shin-ichi; OKAMOTO, Yoshio et al.Algorithmica. 2013, Vol 67, Num 1, issn 0178-4617, 111 p.Conference Proceedings

Algorithms and ComputationDU, Ding-Zhu; DONG, Yingfei; ZHANG, Zhao et al.Theoretical computer science. 2011, Vol 412, Num 32, issn 0304-3975, 155 p.Conference Proceedings

Algorithms and ComputationCHWA, Kyung-Yong; PARK, Kunsoo.Algorithmica. 2012, Vol 64, Num 3, issn 0178-4617, 208 p.Serial Issue

Algorithms and ComputationTOKUYAMA, Takeshi.Algorithmica. 2010, Vol 56, Num 1, issn 0178-4617, 128 p.Conference Proceedings

Minimum Degree OrderingsNAGAMOCHI, Hiroshi.Algorithmica. 2010, Vol 56, Num 1, pp 17-34, issn 0178-4617, 18 p.Conference Paper

International Symposium on Algorithms and Computation (ISAAC)DENG XIAOTIE; DINGZHU DU.Algorithmica. 2008, Vol 51, Num 3, issn 0178-4617, 130 p.Conference Proceedings

Annual International Symposium on Algorithms and ComputationFLEISCHER, Rudolf.Algorithmica. 2006, Vol 46, Num 1, issn 0178-4617, 148 p.Conference Proceedings

Annual International Symposium on Algorithms and ComputationBOSE, Prosenjit; MORIN, Pat.Algorithmica. 2005, Vol 42, Num 1, issn 0178-4617, 107 p.Conference Proceedings

External-Memory MultimapsANGELINO, Elaine; GOODRICH, Michael T; MITZENMACHER, Michael et al.Algorithmica. 2013, Vol 67, Num 1, pp 23-48, issn 0178-4617, 26 p.Conference Paper

Annual International Symposium on Algorithms and ComputationAlgorithmica. 2006, Vol 44, Num 2, issn 0178-4617, 81 p.Conference Proceedings

Fourth International Workshop on Algorithms and ComputationFUJITA, Satoshi; RAHMAN, Md. Saidur.Journal of combinatorial optimization. 2012, Vol 24, Num 2, issn 1382-6905, 82 p.Conference Proceedings

Algorithms and computationCHEN, Zhi-Zhong; DENG, Xiaotie; DU, Ding-zhu et al.Theoretical computer science. 2007, Vol 378, Num 3, issn 0304-3975, 124 p.Serial Issue

Reconstructing polygons from scanner dataBIEDL, Therese; DUROCHER, Stephane; SNOEYINK, Jack et al.Theoretical computer science. 2011, Vol 412, Num 32, pp 4161-4172, issn 0304-3975, 12 p.Conference Paper

Faster Combinatorial Algorithms for Determinant and PfaffianURBANSKA, Anna.Algorithmica. 2010, Vol 56, Num 1, pp 35-50, issn 0178-4617, 16 p.Conference Paper

Computing Sparse Multiples of PolynomialsGIESBRECHT, Mark; ROCHE, Daniel S; TILAK, Hrushikesh et al.Algorithmica. 2012, Vol 64, Num 3, pp 454-480, issn 0178-4617, 27 p.Article

Strong Conflict-Free Coloring for Intervals : Algorithms and ComputationCHEILARIS, Panagiotis; GARGANO, Luisa; RESCIGNO, Adele A et al.Algorithmica. 2014, Vol 70, Num 4, pp 732-749, issn 0178-4617, 18 p.Article

The Minimum Vulnerability Problem : Algorithms and ComputationASSADI, Sepehr; EMAMJOMEH-ZADEH, Ehsan; NOROUZI-FARD, Ashkan et al.Algorithmica. 2014, Vol 70, Num 4, pp 718-731, issn 0178-4617, 14 p.Article

Bounds on contention management algorithmsSCHNEIDER, Johannes; WATTENHOFER, Roger.Theoretical computer science. 2011, Vol 412, Num 32, pp 4151-4160, issn 0304-3975, 10 p.Conference Paper

Complexity and approximation of the Constrained Forest problemBAZGAN, Cristina; COUËTOUX, Basile; TUZA, Zsolt et al.Theoretical computer science. 2011, Vol 412, Num 32, pp 4081-4091, issn 0304-3975, 11 p.Conference Paper

Identifying Shapes Using Self-assemblyPATITZ, Matthew J; SUMMERS, Scott M.Algorithmica. 2012, Vol 64, Num 3, pp 481-510, issn 0178-4617, 30 p.Article

Electric routing and concurrent flow cuttingKELNER, Jonathan; MAYMOUNKOV, Petar.Theoretical computer science. 2011, Vol 412, Num 32, pp 4123-4135, issn 0304-3975, 13 p.Conference Paper

The School Bus Problem on TreesBOCK, Adrian; GRANT, Elyot; KÖNEMANN, Jochen et al.Algorithmica. 2013, Vol 67, Num 1, pp 49-64, issn 0178-4617, 16 p.Conference Paper

QueapsIACONO, John; LANGERMAN, Stefan.Algorithmica. 2005, Vol 42, Num 1, pp 49-56, issn 0178-4617, 8 p.Conference Paper

Twelfth Annual International Symposium on Algorithms and ComputationTAKAOKA, Tadao.Algorithmica. 2004, Vol 38, Num 2, pp 269-413, issn 0178-4617, 145 p.Conference Proceedings

Computing large matchings in planar graphs with fixed minimum degreeFRANKE, Robert; RUTTER, Ignaz; WAGNER, Dorothea et al.Theoretical computer science. 2011, Vol 412, Num 32, pp 4092-4099, issn 0304-3975, 8 p.Conference Paper

  • Page / 81